Normal triangulations in o-minimal structures
نویسنده
چکیده
We work over an o-minimal expansion of a real closed field R. Given a closed simplicial complex K and some definable subsets S1, . . . , Sk of its realization |K| in R we prove that there exists a triangulation (K , φ) of |K| compatible with S1, . . . , Sk such thatK ′ is a subdivision of K and φ is definably homotopic to id|K|.
منابع مشابه
Minimal Triangulations in Time O ( n α log n ) = o ( n 2 . 376 ) ∗
The problem of computing minimal triangulations of graphs, also called minimal fill, was introduced and solved in 1976 by Rose, Tarjan, and Lueker [17] in time O(nm), thus O(n) for dense graphs. Although the topic has received increasing attention since then, and several new results on characterizing and computing minimal triangulations have been presented, this first time bound has remained th...
متن کاملMinimal Triangulations in O ( n log n ) Time Pinar
The problem of computing minimal triangulations, or minimal ll, of graphs was introduced and solved in 1976 by Rose, Tarjan, and Lueker in time O(nm), thus O(n) for dense graphs. Although the topic has received increasing attention since then, and several new results on characterizing and computing minimal triangulations have been presented, this rst time bound has remained unbeaten. In this pa...
متن کاملk-NORMAL SURFACES
Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following results: • a minimal triangulation of a closed irreducible or a bounded hyperbolic 3-manifold contains no non-trivial k-normal sphere; • every triangulation of a c...
متن کاملA Characterisation of the Minimal Triangulations of Permutation Graphs
A minimal triangulation of a graph is a chordal graph obtained from adding an inclusion-minimal set of edges to the graph. For permutation graphs, i.e., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We g...
متن کاملConcerning the frame of minimal prime ideals of pointfree function rings
Let $L$ be a completely regular frame and $mathcal{R}L$ be the ring of continuous real-valued functions on $L$. We study the frame $mathfrak{O}(Min(mathcal{R}L))$ of minimal prime ideals of $mathcal{R}L$ in relation to $beta L$. For $Iinbeta L$, denote by $textit{textbf{O}}^I$ the ideal ${alphainmathcal{R}Lmidcozalphain I}$ of $mathcal{R}L$. We show that sending $I$ to the set of minimal prime ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 75 شماره
صفحات -
تاریخ انتشار 2010